Secret Sharing with Reusable Polynomials

نویسندگان

  • Liqun Chen
  • Dieter Gollmann
  • Chris J. Mitchell
  • Peter R. Wild
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode

In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

متن کامل

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

متن کامل

An Analytic Construction of the Visual Secret Sharing Scheme for Color Images∗

This paper proposes a new construction of the visual secret sharing scheme for the (n, n)-threshold access structure applicable to color images. The construction uses matrices with n rows that can be identified with homogeneous polynomials of degree n. It is shown that, if we find a set of homogeneous polynomials of degree n satisfying a certain system of simultaneous partial differential equat...

متن کامل

Quantum secret sharing based on a reusable

Reply to Comments on " Quantum Key Distribution for d-level systems for generalized Bell states " [Phys. Rev. A, 052331, (2002)] and " Quantum secret sharing based on a reusable Greenberger-Horne-Zeilinger states as secure carriers " [Phys. Abstract We show that the criticisms of two recent comments [1, 2] on the insecurity of quantum key distributions proposed in [3] and [4] and the secret sha...

متن کامل

A Reusable Multipartite Secret Sharing Scheme Based on Superincreasing Sequence

A new multipartite secret sharing scheme that uses a super increasing sequence is proposed in this paper. Novelty of the scheme is that, apart from being a multipartite scheme, it realizes the level ordered access structure [17]. Also, the proposed scheme is reusable in that the shares of the participants need not be replenished for a new secret after the reconstruction the current secret.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997